Toward <inline-formula> <tex-math notation="LaTeX">$k$ </tex-math></inline-formula>-Connectivity of the Random Graph Induced by a Pairwise Key Predistribution Scheme With Unreliable Links
نویسندگان
چکیده
منابع مشابه
Towards $k$-connectivity of the random graph induced by a pairwise key predistribution scheme with unreliable links
We study the secure and reliable connectivity of wireless sensor networks. Security is assumed to be ensured by the random pairwise key predistribution scheme of Chan, Perrig, and Song, and unreliable wireless links are represented by independent on/off channels. Modeling the network by an intersection of a random K-out graph and an Erdős-Rényi graph, we present scaling conditions (on the numbe...
متن کاملOn the random graph induced by a random key predistribution scheme under full visibility (Extended version)
We consider the random graph induced by the random key predistribution scheme of Eschenauer and Gligor under the assumption of full visibility. We show the existence of a zero-one law for the absence of isolated nodes, and complement it by a Poisson convergence for the number of isolated nodes. Leveraging earlier results and analogies with Erdős-Renyi graphs, we explore similar results for the ...
متن کامل$k$-connectivity of Inhomogeneous Random Key Graphs with Unreliable Links
Abstract—We consider secure and reliable connectivity in wireless sensor networks that utilize a heterogeneous random key predistribution scheme. We model the unreliability of wireless links by an on-off channel model that induces an Erdős-Rényi graph, while the heterogeneous scheme induces an inhomogeneous random key graph. The overall network can thus be modeled by the intersection of both gr...
متن کاملk-Connectivity in Random Key Graphs With Unreliable Links
Random key graphs form a class of random intersec-tion graphs and are naturally induced by the random key predis-tribution scheme of Eschenauer and Gligor for securing wirelesssensor network (WSN) communications. Random key graphshave received much interest recently, owing in part to theirwide applicability in various domains including recommendersystems, social networks...
متن کاملOn the scalability of the random pairwise key predistribution scheme: Gradual deployment and key ring sizes
The pairwise key distribution scheme of Chan et al. is a randomized key predistribution scheme which enables cryptographic protection in wireless sensor networks (WSNs). Although this pairwise scheme has several advantages over other randomized key predistribution schemes, including the original scheme of Eschenauer and Gligor, it has been deemed non-scalable for the following two reasons: (i) ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 2015
ISSN: 0018-9448,1557-9654
DOI: 10.1109/tit.2015.2471295